Typical = Random

نویسندگان

چکیده

This expository paper advocates an approach to physics in which “typicality” is identified with a suitable form of algorithmic randomness. To this end various theorems from mathematics and are reviewed. Their original versions state that some property Φ(x) holds for P-almost all x∈X, where P probability measure on space X. more refined (and typically recent) formulations show P-random x∈X. The computational notion P-randomness used here generalizes the one introduced by Martin-Löf 1966 way now standard Examples come theory, analysis, dynamical systems/ergodic statistical mechanics, quantum mechanics (especially hidden variable theories). An underlying philosophical theme, inherited von Mises Kolmogorov, interplay between randomness, especially: comes first?

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Typical Surfaces and Random Graphs

In this talk, we describe an approach to the problem: What does a typical Riemann surface of large genus look like geometrically? In large part, this is joint work with Eran Makover. As various parts of this program have been described elsewhere (PS], SGB], LFE],RCRS]), we will take the present occasion to describe some of the motivating ideas behind the program. See FERS] for an announcement o...

متن کامل

Random Lattices and Random Sphere Packings: Typical Properties

We review results about the density of typical lattices in R. This density is of the order of 2−n. We then obtain similar results for random (non-lattice) sphere packings in R: after suitably taking a fraction ν of centers of spheres in a typical random packing σ, the resulting packing τ has density C(ν)2−n with a reasonable C(ν). We obtain estimates of C(ν). 2000 Math. Subj. Class. 82B05.

متن کامل

Error exponents of typical random codes

We define the error exponent of the typical random code as the long–block limit of the negative normalized expectation of the logarithm of the error probability of the random code, as opposed to the traditional random coding error exponent, which is the limit of the negative normalized logarithm of the expectation of the error probability. For the ensemble of uniformly randomly drawn fixed comp...

متن کامل

Typical Distances in Ultrasmall Random Networks

We show that in preferential attachment models with power-law exponent τ ∈ (2, 3) the distance between randomly chosen vertices in the giant component is asymptotically equal to (4 + o(1)) log logN − log(τ−2) , where N denotes the number of nodes. This is twice the value obtained for the configuration model with the same power-law exponent. The extra factor reveals the different structure of ty...

متن کامل

Multiple Description Coding: Typical Arguments and Random Binning

We reexamine the problem of Multiple Description coding considered last week. We briefly review the import concepts and results. An overview of the basic methods of proof are provided. We further formulate this problem in the context of distributed source coding and from this framework examine a practical coding scheme for the symmetric problem provided by Pradhan et. al.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Axioms

سال: 2023

ISSN: ['2075-1680']

DOI: https://doi.org/10.3390/axioms12080727